Rota ’ s Conjecture for infinite matroids
نویسندگان
چکیده
9:30 10:30 Bruce Reed How many edges force an H-minor? 10:30 11:00 Coffee Break 11:00 11:20 Chun-Hung Liu Well-quasi-ordering graphs by the topological minor relation 11:25 11:45 Jean-Florent Raymond An edge variant of Erdős-Pósa property 11:50 12:10 Irene Muzi Subdivisions in 4-connected graphs of large tree-width 12:10 3:30 Lunch and discussion 3:30 4:30 Dan Kral FO limits of trees 4:30 5:00 Coffee Break 5:00 5:20 Louis Esperet Coloring planar graphs with three colors and no large monochromatic components 5:25 5: 45 Kenta Ozeki An extension to 3-colorable or Eulerian triangulations 5:50 6:10 Matej Stehlik Coloring higher dimensional projective quadrangulations
منابع مشابه
Rota's Basis Conjecture for Paving Matroids
Rota conjectured that, given n disjoint bases of a rank-n matroid M , there are n disjoint transversals of these bases that are all bases of M . We prove a stronger statement for the class of paving matroids.
متن کاملStrongly Inequivalent Representations and Tutte Polynomials of Matroids
We develop constructive techniques to show that non-isomorphic 3-connected matroids that are representable over a fixed finite field and that have the same Tutte polynomial abound. In particular, for most prime powers q, we construct infinite families of sets of 3-connected matroids for which the matroids in a given set are non-isomorphic, are representable over GF(q), and have the same Tutte p...
متن کاملOn the intersection of infinite matroids
We show that the infinite matroid intersection conjecture of NashWilliams implies the infinite Menger theorem proved recently by Aharoni and Berger. We prove that this conjecture is true whenever one matroid is nearly finitary and the second is the dual of a nearly finitary matroid, where the nearly finitary matroids form a superclass of the finitary matroids. In particular, this proves the inf...
متن کاملSolving Rota’s Conjecture
I n 1970, Gian-Carlo Rota posed a conjecture predicting a beautiful combinatorial characterization of linear dependence in vector spaces over any given finite field. We have recently completed a fifteen-year research program that culminated in a solution of Rota’s Conjecture. In this article we discuss the conjecture and give an overview of the proof. Matroids are a combinatorial abstraction of...
متن کاملOn the intersection conjecture for infinite trees of matroids
Using a new technique, we prove a rich family of special cases of the matroid intersection conjecture. Roughly, we prove the conjecture for pairs of tame matroids which have a common decomposition by 2-separations into finite parts.
متن کاملThe Intersection of a Matroid and a Simplicial Complex
A classical theorem of Edmonds provides a min-max formula relating the maximal size of a set in the intersection of two matroids to a “covering” parameter. We generalize this theorem, replacing one of the matroids by a general simplicial complex. One application is a solution of the case r = 3 of a matroidal version of Ryser’s conjecture. Another is an upper bound on the minimal number of sets ...
متن کامل